Short Bisection Implementation in Matlab
نویسنده
چکیده
This is the documentation of the local mesh refinement using newest bisection or longest bisection in MATLAB. The new feature of our implementation is the edge marking strategy to ensure the conformity. The short implementation is helpful for the teaching of adaptive finite element methods and programming in more advanced languages.
منابع مشابه
Line Bisection Test Software to Evaluate the Visual-spatial Functions in Schizophrenic Patients
Introduction: One way to evaluate visual-spatial functions is to use line bisection test. With the advancement of information technology, this study attempted to design a line bisection test software and investigate its efficacy compared to the conventional paper-pencil form in schizophrenic patients. Method: The present study was a causal-comparative one and line bisection test software was de...
متن کاملLine Bisection Test Software to Evaluate the Visual-spatial Functions in Schizophrenic Patients
Introduction: One way to evaluate visual-spatial functions is to use line bisection test. With the advancement of information technology, this study attempted to design a line bisection test software and investigate its efficacy compared to the conventional paper-pencil form in schizophrenic patients. Method: The present study was a causal-comparative one and line bisection test software was de...
متن کاملA Matrix Partitioning Interface to PaToH in MATLAB
We present the PaToH MATLAB Matrix Partitioning Interface. The interface provides support for hypergraph-based sparse matrix partitioning methods which are used for efficient parallelization of sparse matrix-vector multiplication operations. The interface also offers tools for visualizing and measuring the quality of a given matrix partition. We propose a novel, multilevel, 2D coarsening-based ...
متن کاملGeometric mesh partitioning: implementation and experiments
We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method’s novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of “well-shaped” finite element meshes have good separators. The geometric method is qui...
متن کاملThe geometric mean algorithm
Bisection (of a real interval) is a well known algorithm to compute eigenvalues of symmetric matrices. Given an initial interval [a, b], convergence to an eigenvalue which has size much smaller than a or b may be made considerably faster if one replaces the usual arithmetic mean (of the end points of the current interval) with the geometric mean. Exploring this idea, we have implemented geometr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006